<html>
<head>
 <title>Antiprime numbers</title>
</head>

<body>
<center>
<h1>POI VIII Stage 1 Problem 3</h1>
<h1>Antiprime numbers</h1>
</center>

<p>
A positive integer <i>n</i> is an antiprime number, when it has more divisors than any positive integer, that is less than
<i>n</i>.&nbsp; These are examples of antiprime numbers: 1, 2, 4, 6, 12 and 24.&nbsp;
</p>

<h2>Task</h2>

<p>
Write a program which:
</p>
<ul>
<li>reads from the text file ANT.IN a positive integer n,
<li>finds the greatest antiprime integer not greater than n,
<li>writes this number in the text file ANT.OUT. 
</ul>

<h2>Input</h2>
<p>
In the only line of the input file ANT.IN  there is one integer <i>n</i>, 1 &lt;=<i> n</i> &lt;= 2 000 000
000.&nbsp;
</p>


<h2>Output</h2>
<p>
In the only line of the output file ANT.OUT your program should write exactly one integer - the greatest antiprime number not greater than n.

<h2>Sample Input</h2>
<pre>1000</pre>

<h2>Sample Output</h2>
<pre>840</pre>

</body>

</html>
